Modified Fault Tolerant Double Tree Network-2
نویسندگان
چکیده
Interconnection networks are constructed to provide inter-process communication. These Networks are compared on the basis of Fault tolerance, Reliability, Path length and cost effectiveness. An irregular class of Fault Tolerant Multistage Interconnection Network (MIN) called Modified Four Double Tree Network-2 (MFDOT-2) is proposed.MFDOT-2 is constructed on the basis of FDOT-2 [1]. The Reliability, Path length and cost effectiveness of some popular irregular class of Multistage Interconnection Networks along with proposed MFDOT-2 is also analyzed.
منابع مشابه
On Permutation Capabilities of Fault Tolerant Multistage Interconnection Networks
In this paper permutation capabilities analysis of fault tolerant [1] Multistage Interconnection Networks have been presented. I have examined some popular FT(Four Tree)[8], MFT(Modified Four Tree)[2], PHI(Phi Network )[11], NFT(New Four Tree)[4], IFT(improved Four Tree)[5], IASN(Irregular Augmented Shuffle)[14] and IIASN(Improved Irregular Augmented Shuffle)[3] networks which are irregular in ...
متن کاملReliability and Performance Analysis of New Fault Tolerant Irregular Network
A lot of work and analysis has been done on regular fault-tolerant MINs but irregular MINS have the inherent concept of favorite memory module offering lower latency. The multipath nature of these networks provides a non-blocking operation. This work introduces a new network, named as MFT-2 network, which contributes fault-tolerance by providing dynamic full-access capability in the presence of...
متن کاملA generalized ABFT technique using a fault tolerant neural network
In this paper we first show that standard BP algorithm cannot yeild to a uniform information distribution over the neural network architecture. A measure of sensitivity is defined to evaluate fault tolerance of neural network and then we show that the sensitivity of a link is closely related to the amount of information passes through it. Based on this assumption, we prove that the distribu...
متن کاملTree-Based Fault-Tolerant Multicast in Multicomputer Networks Using Pipelined Circuit Switching
A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. For every multicast message, a multicast tree is constructed in a distributed and adaptive fashion. An underlying fault-tolerant routing algorithm is used to tolerate faulty nodes and links without requiring nodes to have global fault information. The multicast algorithm is provably deadloc...
متن کاملD3-Tree: A Dynamic Distributed Deterministic Load - Balancer for decentralized tree structures
In this work, we propose D-Tree, a dynamic distributed deterministic structure for data management in decentralized networks. We present in brief the theoretical algorithmic analysis, in which our proposed structure is based on, and we describe thoroughly the key aspects of the implementation. Conducting experiments, we verify that the implemented structure outperforms other well-known hierarch...
متن کامل